306A - Candies - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

n,m = map(int,input().split())
for i in range(n%m):
    print((n//m)+1)
for i in range(m-n%m):
    print(n//m)


Comments

Submit
1 Comments
  • 29/1/2024 10:59 - Asia/Calcutta

n,m = map(int,input().split()) for i in range(n%m): print((n//m)+1) for i in range(m-n%m): print(n//m)


More Questions

1624C - Division by Two and Permutation
1288A - Deadline
1617A - Forbidden Subsequence
914A - Perfect Squares
873D - Merge Sort
1251A - Broken Keyboard
463B - Caisa and Pylons
584A - Olesya and Rodion
799A - Carrot Cakes
1569B - Chess Tournament
1047B - Cover Points
1381B - Unmerge
1256A - Payment Without Change
908B - New Year and Buggy Bot
979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2